Improving the Performance of MOACO Algorithms by Applying Colony-Level Parallelization

نویسندگان

  • Antonio M. Mora
  • Ben Paechter
  • Emma Hart
  • Michele Weiland
چکیده

In this work, the parallelization of some Multi-Objective Ant Colony Optimization (MOACO) algorithms has been performed. The aim is to get a better performance for these classical optimization metaheuristics, not only relating to the running time, usual objective when a parallelization method is applied, but also improving the quality of the yielded solutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Study of Parallel Approaches in MOACOs for Solving the Bicriteria TSP

In this work, the parallelization of some Multi-Objective Ant Colony Optimization (MOACO) algorithms has been performed. The aim is to get a better performance, not only in running time (usually the main objective when a distributed approach is implemented), but also improving the spread of solutions over the Pareto front (the ideal set of solutions). In order to do this, colony-level (coarsegr...

متن کامل

Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem

Most real world combinatorial optimization problems are difficult to solve with multiple objectives which have to be optimized simultaneously. Over the last few years, researches have been proposed several ant colony optimization algorithms to solve multiple objectives. The aim of this paper is to review the recently proposed multi-objective ant colony optimization (MOACO) algorithms and compar...

متن کامل

Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems

This paper proposes a framework named multiobjective ant colony optimization based on decomposition (MoACO/D) to solve bi-objective traveling salesman problems (bTSPs). In the framework, a bTSP is first decomposed into a number of scalar optimization subproblems using Tchebycheff approach. To suit for decomposition, an ant colony is divided into many subcolonies in an overlapped manner, each of...

متن کامل

Automatic Generation of Multi-objective ACO Algorithms for the Bi-objective Knapsack

Multi-objective ant colony optimization (MOACO) algorithms have shown promising results for various multi-objective problems, but they also offer a large number of possible design choices. Often, exploring all possible configurations is practically infeasible. Recently, the automatic configuration of a MOACO framework was explored and was shown to result in new state-of-the-art MOACO algorithms...

متن کامل

A new multi-objective mathematical model for a Citrus supply chain network design: Metaheuristic algorithms

Nowadays, the citrus supply chain has been motivated by both industrial practitioners and researchers due to several real-world applications. This study considers a four-echelon citrus supply chain, consisting of gardeners, distribution centers, citrus storage, and fruit market. A Mixed Integer Non-Linear Programming (MINLP) model is formulated, which seeks to minimize the total cost and maximi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010